Mann-type Steepest-descent and Modified Hybrid Steepest-descent Methods for Variational Inequalities in Banach Spaces
نویسندگان
چکیده
1Department of Mathematics, Shanghai Normal University, Shanghai; and Scientific Computing Key Laboratory of Shanghai Universities, Shanghai, China 2Department of Mathematics & Statistics, College of Science, King Fahd University of Petroleum & Minerals, Dhahran, Saudi Arabia; and Department of Mathematics, Aligarh Muslim University, Aligarh, India 3Department of Applied Mathematics, National Sun Yat-Sen University, Kaohsiung, Taiwan
منابع مشابه
Hybrid steepest-descent method with sequential and functional errors in Banach space
Let $X$ be a reflexive Banach space, $T:Xto X$ be a nonexpansive mapping with $C=Fix(T)neqemptyset$ and $F:Xto X$ be $delta$-strongly accretive and $lambda$- strictly pseudocotractive with $delta+lambda>1$. In this paper, we present modified hybrid steepest-descent methods, involving sequential errors and functional errors with functions admitting a center, which generate convergent sequences ...
متن کاملA Generalized Hybrid Steepest-Descent Method for Variational Inequalities in Banach Spaces
The hybrid steepest-descent method introduced by Yamada 2001 is an algorithmic solution to the variational inequality problem over the fixed point set of nonlinear mapping and applicable to a broad range of convexly constrained nonlinear inverse problems in real Hilbert spaces. Lehdili and Moudafi 1996 introduced the new prox-Tikhonov regularization method for proximal point algorithm to genera...
متن کاملEfficient implementation of a modified and relaxed hybrid steepest-descent method for a type of variational inequality
To reduce the difficulty and complexity in computing the projection from a real Hilbert space onto a nonempty closed convex subset, researchers have provided a hybrid steepest-descent method for solving VI(F,K) and a subsequent three-step relaxed version of this method. In a previous study, the latter was used to develop a modified and relaxed hybrid steepest-descent (MRHSD) method. However, ch...
متن کاملConvergence of iterative sequences for fixed points of an infinite family of nonexpansive mappings based on a hybrid steepest descent methods
The propose of this article is to consider the strong convergence of an iterative sequences for finding a common element of the set of fixed points of an infinite family of nonexpansive mappings, the set of solutions of the variational inequalities for inverse strongly monotone mappings, and the set of solutions of system of equilibrium problems in Hilbert spaces by using a hybrid steepest desc...
متن کاملAn Algorithm for Solving Triple Hierarchical Pseudomonotone Variational Inequalities
In this paper, we introduce and analyze a hybrid steepest-descent extragradient algorithm for solving triple hierarchical pseudomonotone variational inequalities in a real Hilbert space. The proposed algorithm is based on Korpelevich’s extragradient method, Mann’s iteration method, hybrid steepest-descent method and Halpern’s iteration method. Under mild conditions, the strong convergence of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008